- bounded completeness
- мат.ограниченная полнота
English-Russian scientific dictionary. 2008.
bounded completeness
Смотреть что такое "bounded completeness" в других словарях:
Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… … Wikipedia
Bounded complete poset — In the mathematical field of order theory, a partially ordered set is bounded complete if all of its subsets which have some upper bound also have a least upper bound. Such a partial order can also be called consistently complete, since any upper … Wikipedia
Completeness (statistics) — In statistics, completeness is a property of a statistic in relation to a model for a set of observed data. In essence, it is a condition which ensures that the parameters of the probability distribution representing the model can all be… … Wikipedia
Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 … Wikipedia
Completeness of the real numbers — Intuitively, completeness implies that there are not any “gaps” (in Dedekind s terminology) or “missing points” in the real number line. This contrasts with the rational numbers, whose corresponding number line has a “gap” at each irrational… … Wikipedia
Completeness axiom — In mathematics the completeness axiom, also called Dedekind completeness of the real numbers, is a fundamental property of the set R of real numbers. It is the property that distinguishes R from other ordered fields, especially from the set of… … Wikipedia
Totally bounded space — In topology and related branches of mathematics, a totally bounded space is a space that can be covered by finitely many subsets of any fixed size (where the meaning of size depends on the given context). The smaller the size fixed, the more… … Wikipedia
Turing completeness — For the usage of this term in the theory of relative computability by oracle machines, see Turing reduction. In computability theory, a system of data manipulation rules (such as an instruction set, a programming language, or a cellular… … Wikipedia
Scott domain — In the mathematical fields of order and domain theory, a Scott domain is an algebraic, bounded complete cpo. It has been named in honour of Dana S. Scott, who was the first to study these structures at the advent of domain theory. Scott domains… … Wikipedia
Hilbert space — For the Hilbert space filling curve, see Hilbert curve. Hilbert spaces can be used to study the harmonics of vibrating strings. The mathematical concept of a Hilbert space, named after David Hilbert, generalizes the notion of Euclidean space. It… … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
